This paper studies the problem of Simultaneous Sparse Approximation (SSA). This problem arises in many applications that work with multiple signals maintaining some degree of dependency, e. g., radar and sensor networks. We introduce a new method towards joint recovery of several independent Sparse signals with the same support. We provide an analytical discussion of the convergence of our method, called Simultaneous Iterative Method (SIM). In this study, we compared our method with other group-Sparse reconstruction techniques, namely Simultaneous Orthogonal Matching Pursuit (SOMP) and Block Iterative Method with Adaptive Thresholding (BIMAT), through numerical experiments. The simulation results demonstrated that SIM outperformed these algorithms in terms of the metrics Signal to Noise Ratio (SNR) and Success Rate (SR). Moreover, SIM is considerably less complicated than BIMAT, which makes it feasible for practical applications such as implementation in MIMO radar systems.